Parametric timing estimation with Newton-Gregory formulae

نویسندگان

  • Robert A. van Engelen
  • Kyle A. Gallivan
  • Burt Walsh
چکیده

This paper presents a novel method for parametric worst-case execution time (WCET) estimation of loops. The method determines a parametric bound on the iteration space size of loops with both affine and nonaffine loop bounds in an efficient manner using a formulation based on Newton–Gregory interpolating polynomials. Parametric WCET formulae are used to support dynamic scheduling decisions at runtime, where the WCET of a scheduled task might not be known statically. To determine worst-case execution time estimates of scientific and multimedia codes, which spent most of the execution time on executing loop iterations, efficient and accurate symbolic loop WCET estimation methods must be capable of analyzing loops with symbolic bounds, non-rectangular loops, zero-trip loops, loops with multiple critical paths, and loops with non-unit strides. Copyright c © 2006 John Wiley & Sons, Ltd.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tight Timing Estimation With the Newton-Gregory Formulae∗

Parametric worst-case execution time (WCET) bounds are critical in removing restrictions, such as known loop bounds, on algorithms for important applications such as scheduling for real-time embedded systems. Current parametric approaches have difficulties with loop nests that include non-rectangular loops, zero-trip loops, and/or loops with non-unit strides. This paper presents a novel approac...

متن کامل

A New High Order Closed Newton-Cotes Trigonometrically-fitted Formulae for the Numerical Solution of the Schrodinger Equation

In this paper, we investigate the connection between closed Newton-Cotes formulae, trigonometrically-fitted methods, symplectic integrators and efficient integration of the Schr¨odinger equation. The study of multistep symplectic integrators is very poor although in the last decades several one step symplectic integrators have been produced based on symplectic geometry (see the relevant lit...

متن کامل

Implicitization of Parametric Curves and Surfaces by Using Multidimensional Newton Formulae

This paper is devoted to present new algorithms computing the implicit equation of a parametric plane curve and several classes of parametric surfaces in the three dimensional euclidean space. These algorithms do not require the computation of any symbolic determinant or Gröbner Basis, being these tools replaced by the computation of some symmetric functions, in particular the Newton Sums, on t...

متن کامل

Newton for non - parametric simultaneous localization and mapping − Gaussian Process

In this paper, we present Gaussian Process Gauss–Newton (GPGN), an algorithm for non-parametric, continuous-time, nonlinear, batch state estimation. This work adapts the methods of Gaussian process (GP) regression to address the problem of batch simultaneous localization and mapping (SLAM) by using the Gauss–Newton optimization method. In particular, we formulate the estimation problem with a c...

متن کامل

A Quasi-Newton Algorithm for Efficient Computation of Gehan Estimates

The analysis of lifetime data is an important research area in statistics, particularly among econometricians and biostatisticians. The two most popular semi-parametric models are the proportional hazards model and the accelerated failure time (AFT) model. The proportional hazards model is computationally advantageous over virtually any other competing semi-parametric model because the ubiquito...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Concurrency and Computation: Practice and Experience

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2006